Structure for nonnegative square roots of unbounded nonnegative selfadjoint operators
نویسندگان
چکیده
منابع مشابه
A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملReweighted nonnegative least-mean-square algorithm
Statistical inference subject to nonnegativity constraints is a frequently occurring problem in signal processing. The nonnegative least-mean-square (NNLMS) algorithm was derived to address such problems in an online way. This algorithm builds on a fixed-point iteration strategy driven by the Karush-Kuhn-Tucker conditions. It was shown to provide low variance estimates, but it however suffers f...
متن کاملNonnegative approximations of nonnegative tensors
We study the decomposition of a nonnegative tensor into a minimal sum of outer product of nonnegative vectors and the associated parsimonious näıve Bayes probabilistic model. We show that the corresponding approximation problem, which is central to nonnegative parafac, will always have optimal solutions. The result holds for any choice of norms and, under a mild assumption, even Brègman diverge...
متن کاملNonnegative Approximations of Nonnegative Tensors
We study the decomposition of a nonnegative tensor into a minimal sum of outer product of nonnegative vectors and the associated parsimonious näıve Bayes probabilistic model. We show that the corresponding approximation problem, which is central to nonnegative parafac, will always have optimal solutions. The result holds for any choice of norms and, under a mild assumption, even Brègman diverge...
متن کاملGale duality bounds for roots of polynomials with nonnegative coefficients
We bound the location of roots of polynomials that have nonnegative coefficients with respect to a fixed but arbitrary basis of the vector space of polynomials of degree at most d. For this, we interpret the basis polynomials as vector fields in the real plane, and at each point in the plane analyze the combinatorics of the Gale dual vector configuration. We apply our technique to bound the loc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quarterly of Applied Mathematics
سال: 1996
ISSN: 0033-569X,1552-4485
DOI: 10.1090/qam/1402405